Multiplicative Adaptive Algorithms for User Preference Retrieval
نویسنده
چکیده
منابع مشابه
Mars: Multiplicative Adaptive Refinement Web Search
This chapter reports the project MARS (Multiplicative Adaptive Refinement Search), which applies a new multiplicative adaptive algorithm for user preference retrieval to Web search. The new algorithm uses a multiplicative query expansion strategy to adaptively improve and reformulate the query vector to learn users’ information preference. The algorithm has provable better performance than the ...
متن کاملMultiplicative Adaptive Refinement Web Search
This chapter reports the project MARS (Multiplicative Adaptive Refinement Search), which applies a new multiplicative adaptive algorithm for user preference retrieval to Web searches. The new algorithm uses a multiplicative query expansion strategy to adaptively improve and reformulate the query vector to learn users’ information preference. The algorithm has provable better performance than th...
متن کاملA Quadratic Programming Method for Ranking Alternatives Based on Multiplicative and Fuzzy Preference Relations
This paper proposes a quadratic programming method (QPM) for ranking alternatives based on multiplicative preference relations (MPRs) and fuzzy preference relations (FPRs). The proposed QPM can be used for deriving a ranking from either a MPR or a FPR, or a group of MPRs, or a group of FPRs, or their mixtures. The proposed approach is tested and examined with two numerical examples, and compara...
متن کاملPersonalized Information Retrieval by Using Adaptive User Profiling and Collaborative Filtering
Many search engines such as Yahoo, Google, MSN, and AltaVista, have been developed to meet various users’ search needs in real world. In general, because of the lack of the personal information such as hobby, preferences, and interests, these existing information retrieval systems are unsuitable to provide personalized search results to users. In this paper, we propose an adaptive user profilin...
متن کامل